On Lucas Sequences Computation

نویسنده

  • Aleksey Koval
چکیده

This paper introduces an improvement to a currently published algorithm to compute both Lucas “sister” sequences Vk and Uk. The proposed algorithm uses Lucas sequence properties to improve the running time by about 20% over the algorithm published in [1].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Properties of Balancing and Lucas-Balancing $p$-Numbers

The main goal of this paper is to develop a new generalization of balancing and Lucas-balancing sequences namely balancing and Lucas-balancing $p$-numbers and derive several identities related to them. Some combinatorial forms of these numbers are also presented.

متن کامل

On the order-k generalized Lucas numbers

In this paper we give a new generalization of the Lucas numbers in matrix representation. Also we present a relation between the generalized order-k Lucas sequences and Fibonacci sequences. 2003 Elsevier Inc. All rights reserved.

متن کامل

Relationship between Fibonacci and Lucas sequences and their application in Symmetric Cryptosystems

Abstract— Identification whether a certain number belongs to either Fibonacci or Lucas sequence is computationally intense task in the sense that the sequence itself need to be written from the beginning until the requested number. In this paper we present a method of detecting whether a certain number is of Lucas or Fibonacci sequence as well as introduce relationships between such sequences. ...

متن کامل

Determinants and permanents of Hessenberg matrices and generalized Lucas polynomials

In this paper, we give some determinantal and permanental representations of generalized Lucas polynomials, which are a general form of generalized bivariate Lucas p-polynomials, ordinary Lucas and Perrin sequences etc., by using various Hessenberg matrices. In addition, we show that determinant and permanent of these Hessenberg matrices can be obtained by using combinations. Then we show, the ...

متن کامل

Computation of the Sadhana (Sd) Index of Linear Phenylenes and Corresponding Hexagonal Sequences

The Sadhana index (Sd) is a newly introduced cyclic index. Efficient formulae for calculating the Sd (Sadhana) index of linear phenylenes are given and a simple relation is established between the Sd index of phenylenes and of the corresponding hexagonal sequences.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IJCNS

دوره 3  شماره 

صفحات  -

تاریخ انتشار 2010